Cyclotomy Primality Proving
نویسنده
چکیده
Two rational primes p, q are called dual elliptic if there is an elliptic curve E mod p with q points. They were introduced as an interesting means for combining the strengths of the elliptic curve and cyclotomy primality proving algorithms. By extending to elliptic curves some notions of galois theory of rings used in the cyclotomy primality tests, one obtains a new algorithm which has heuristic cubic run time and generates certificates that can be verified in quadratic time. After the break through of Agrawal, Kayal and Saxena has settled the complexity theoretical problem of primality testing, some interest remains for the practical aspect of state of the art implementable proving algorithms.
منابع مشابه
Cyclotomy Primality Proofs and Their Certificates
The first efficient general primality proving method was proposed in the year 1980 by Adleman, Pomerance and Rumely and it used Jacobi sums. The method was further developed by H. W. Lenstra Jr. and more of his students and the resulting primality proving algorithms are often referred to under the generic name of Cyclotomy Primality Proving (CPP). In the present paper we give an overview of the...
متن کاملElliptic Curves, Primality Proving and Some Titanic Primes
We describe how to generate large primes using the primality proving algorithm of Atkin. Figure 1: The Titanic .
متن کاملFast Primality Proving on Cullen Numbers
We present a unconditional deterministic primality proving algorithm for Cullen numbers. The expected running time and the worst case running time of the algorithm are Õ(logN) bit operations and Õ(logN) bit operations, respectively.
متن کاملDistributed Primality Proving and the Primality of (23539+1)/3
We explain how the Elliptic Curve Primality Proving algorithm can be implemented in a distributed way. Applications are given to the certiication of large primes (more than 500 digits). As a result, we describe the successful attempt at proving the primality of the 1065-digit (2 3539 +1)=3, the rst ordinary Titanic prime.
متن کاملImplementing the Asymptotically Fast Version of the Elliptic Curve Primality Proving Algorithm Less Prelimimary Version 040825
The elliptic curve primality proving algorithm is one of the fastest practical algorithms for proving the primality of large numbers. Its running time cannot be proven rigorously, but heuristic arguments show that it should run in time Õ((logN)) to prove the primality of N . An asymptotically fast version of it, attributed to J. O. Shallit, runs in time Õ((logN)). The aim of this article is to ...
متن کامل